翻訳と辞書 Words near each other ・ Hylogenesis ・ Hylograptis ・ Hylograptis thryptica ・ Hyloidea ・ Hylomantis ・ Hylomantis aspera ・ Hylomantis buckleyi ・ Hylomantis danieli ・ Hylomantis granulosa ・ Hylomantis hulli ・ Hylomantis lemur ・ Hylomantis medinai ・ Hylomantis psilopygion ・ Hylomecon ・ Hylomorphism ・ Hylomorphism (computer science) ・ Hylomyrma ・ Hylomyrma balzani ・ Hylomys ・ Hylomyscus ・ Hylomyscus endorobae ・ Hylomyscus vulcanorum ・ Hyloniscus riparius ・ Hylonome ・ Hylonomus ・ Hylonycta ・ Hylopanchax ・ Hylopathism ・ Hylopaussus ・ Hylopercnas Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Hylomorphism (computer science) ： ウィキペディア英語版 Hylomorphism (computer science) In computer science, and in particular functional programming, a hylomorphism is a recursive function, corresponding to the composition of an anamorphism (which first builds a set of results; also known as 'unfolding') followed by a catamorphism (which then folds these results into a final return value). Fusion of these two recursive computations into a single recursive pattern then avoids building the intermediate data structure. This is an example of deforestation, a program optimization strategy. A related type of function is a metamorphism, which is a catamorphism followed by an anamorphism. ==Formal definition== A hylomorphism $h\; :\; A\; \backslash rightarrow\; C$ can be defined in terms of its separate anamorphic and catamorphic parts. The anamorphic part can be defined in terms of a unary function $g\; :\; A\; \backslash rightarrow\; B\; \backslash times\; A$ defining the list of elements in $B$ by repeated application (''"unfolding"''), and a predicate $p\; :\; A\; \backslash rightarrow\; \backslash text$ providing the terminating condition. The catamorphic part can be defined as a combination of an initial value $c\; \backslash in\; C$ for the fold and a binary operator $\backslash oplus\; :\; B\; \backslash times\; C\; \backslash rightarrow\; C$ used to perform the fold. Thus a hylomorphism :$$ h\,a = \begin c & \mbox p\,a \\b \oplus ha' & \mbox \end (where $(b,\; a\text{'})\; =\; ga$) may be defined (assuming appropriate definitions of $p$ & $g$). 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Hylomorphism (computer science)」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.